Fast Placement for Large-scale Hierarchical FPGAs1
نویسندگان
چکیده
In this paper, we propose a fast placer for FPGA placement on a new commercial hierarchical FPGA device. The novelty of this research lies in the application of a multilevel V-shape optimization flow including an architecture related cluster process and a constructive placement. The new placer can handle large-scale FPGA placement problem quickly. Experimental results show that the proposed placer can further reduced the wirelength average 28.3% compared with simulated annealing based tool while achieving near 5X speedup in runtime for the five largest MCNC benchmarks.
منابع مشابه
Management and Placement of Replicas in a Hierarchical Data Grid
In large systems, data management is only possible through the use of replication techniques. In order to improve availability and ensure fast and efficient access, we propose in this paper a dynamic replication algorithm which takes into account also the placement of data in a hierarchical data grid. Experimental results show the effectiveness of our approach in terms of response time and avai...
متن کاملDRAGON 2000 : STANDARD - CELL PLACEMENT TOOL FOR LARGE INDUSTRYCIRCUITSMaogang
In this paper, we develop a new standard cell placement tool, Dragon2000, to solve large scale placement problem eeectively. A top-down hierarchical approach is used in Dragon2000. State-of-the-art partitioning tools are tightly integrated with wirelength minimization techniques to achieve superior performance. We argue that net-cut minimization is a good and important shortcut to solve the lar...
متن کاملOpen Architecture Hierarchical Placement for Fpga Datapath Designs
The study of circuit placement in VLSI physical design has been conducted for several decades. As circuit complexity increases, it is non-trivial to place all cells of the circuit within a reasonable time. Many researchers have presented new placement algorithms and tools to address placement issues such as minimization of wire length, routability, and run-time. Our approach is different in tha...
متن کاملA PARALLEL HIERARCHICAL ALGORITHM FOR MODULE PLACEMENT BASED ON SPARSE LINEAR EQUATIONS - Circuits and Systems, 1996., ISCAS '96, 'Connecting the World'., 1996 IEEE International Symposium
We present a fast and effective module placement algorithm which is based on the PROUD algorithm. The PROUD algorithm uses a hierarchical decomposition technique and the solution of sparse linear systems of equations based on a resistive network analogy. It has been shown that the PROUD algorithm is suitable for solving the placement problem for very large circuits, and obtains placement qualit...
متن کاملA Parallel Hierarchical Algorithm for Module Placement Based on Sparse Linear Equations
We present a fast and eeective module placement algorithm which is based on the PROUD algorithm. The PROUD algorithm uses a hierarchical decomposition technique and the solution of sparse linear systems of equations based on a resistive network analogy. It has been shown that the PROUD algorithm is suitable for solving the placement problem for very large circuits , and obtains placement qualit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009